Minimal Graphs
نویسنده
چکیده
n 1 (0) ! R and ⌦ open ⇢ B, define A(u; ⌦) = Area (graph u| ⌦) = Z ⌦ p 1 + |Du| 2 , where, by 'area', we mean n-dimensional Hausdor↵ measure. The notation A(u) simply means Area (graph u). It can be established (firstly for C 1 functions using integration by parts and duality and then by approximating a Lipschitz function in the L 1 norm by a sequence of C 1 functions) that for any Lipschitz u : B ! R, we have (1) A(u) = sup g2C 1 c (B,R From here one can easily deduce that A is strictly convex on L and lower semicon-tinuous with respect to weak L 1 convergence. Given f 2 C 2 (@B), if u 2 C 2 (B) is such that u| @B = f and A(u) A(˜ u) for any˜u 2 C 2 (B) with˜u| @B = f , then u solves the Dirichlet problem for the Minimal Surface Equation, i.e. Mu := div Du p 1 + |Du| 2 ! = 0 in B u = f on @B Write L L for the set of all Lipschitz functions u : B ! R with u| @B = f and Lip u L and write a L := inf˜u2L L A(˜ u). The symbols L and a are defined similarly, but without the condition that Lip u L. 1 j=1 2 L L with A(u j) ! a L as j ! 1. The fact that Lip u j L for every j means that {u j } 1 j=1 is equicontinuous and for suciently large j, this sequence must also be uniformly bounded (why?). Therefore the Arzela – Ascoli theorem implies that there exists v 2 L L and a subsequence {j 0 } of {j} such that u j 0 ! v uniformly as j ! 1. Setting u L := v, the first claim follows from the lower semicontinuity of A with respect to weak L 1 convergence. Now giveñ u 2 L observe that (tu L + (1 t)˜ u)| @B = f for all t 2 (0, 1) and that Lip(tu L + (1 t)˜ u) k for suciently small t > 0. Thus for suciently small t > 0 we have (tu L + (1 t)˜ u) 2 L L whence A(u L) …
منابع مشابه
Cohen-Macaulay $r$-partite graphs with minimal clique cover
In this paper, we give some necessary conditions for an $r$-partite graph such that the edge ring of the graph is Cohen-Macaulay. It is proved that if there exists a cover of an $r$-partite Cohen-Macaulay graph by disjoint cliques of size $r$, then such a cover is unique.
متن کاملAll Ramsey (2K2,C4)−Minimal Graphs
Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...
متن کاملDesigning Solvable Graphs for Multiple Moving Agents
Solvable Graphs (also known as Reachable Graphs) are types of graphs that any arrangement of a specified number of agents located on the graph’s vertices can be reached from any initial arrangement through agents’ moves along the graph’s edges, while avoiding deadlocks (interceptions). In this paper, the properties of Solvable Graphs are investigated, and a new concept in multi agent moti...
متن کاملSolis Graphs and Uniquely Metric Basis Graphs
A set $Wsubset V (G)$ is called a resolving set, if for every two distinct vertices $u, v in V (G)$ there exists $win W$ such that $d(u,w) not = d(v,w)$, where $d(x, y)$ is the distance between the vertices $x$ and $y$. A resolving set for $G$ with minimum cardinality is called a metric basis. A graph with a unique metric basis is called a uniquely dimensional graph. In this paper, we establish...
متن کاملA Characterisation of the Minimal Triangulations of Permutation Graphs
A minimal triangulation of a graph is a chordal graph obtained from adding an inclusion-minimal set of edges to the graph. For permutation graphs, i.e., graphs that are both comparability and cocomparability graphs, it is known that minimal triangulations are interval graphs. We (negatively) answer the question whether every interval graph is a minimal triangulation of a permutation graph. We g...
متن کاملGraph extremities and minimal separation
A. Berry Abstra t: Many problems related to knowledge dis overy an be modelized by an undire ted graph, whi h in turn has a strong stru ture asso iated with its minimal separators. On several well-known graph lasses whi h are used in appli ations, the graph extremities and the related elimination orderings are an eÆ ient algorithmi tool. Often, these extremities turn out to be related to the mi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015